Cse 522: Sublinear (and Streaming) Algorithms Lecture 17: Tolerant Testing, Graph Algorithms/streaming 2 Sublinear Mutliplicative-additive Approximation Algorithms
نویسنده
چکیده
This gives complete freedom to answer if the input is close to having property P but does not exactly have this property. It is natural to think of property testing algorithms for which the input queries might have a very small probability of error. In this case it would be good to be able to separate inputs that are ε-far from having property P from those that are ε′-close to having property P where ε′ > 0. We call this a (ε′, ε)-tolerant tester. Ideally, one would want such a tester to have a running time that is a small inverse polynomial in ε− ε′.
منابع مشابه
Cse 522: Sublinear (and Streaming) Algorithms 1 a Constant Factor Approximation Algorithm for F 0
We begin by analyzing the basic estimation algorithm we saw last time.
متن کامل05291 Abstracts Collection Sublinear Algorithms Dagstuhl Seminar
From 17.07.05 to 22.07.05, the Dagstuhl Seminar 05291 Sublinear Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are...
متن کاملTestable Bounded Degree Graph Properties Are Random Order Streamable
We study which property testing and sublinear time algorithms can be transformed into graph streaming algorithms for random order streams. Our main result is that for bounded degree graphs, any property that is constant-query testable in the adjacency list model can be tested with constant space in a single-pass in random order streams. Our result is obtained by estimating the distribution of l...
متن کاملCse 522: Sublinear (and Streaming) Algorithms Lecture 13: Coresets and Geometric Streams
Before we move on, we briefly mention the last of the statistical problems we will consider for the data stream model. The problem in this case is to approximately produce the rank of elements in the input sequence. The relative rank of j with respect to a data stream with non-negative input frequencies is ∑ i≤j fi/||f ||1. There are two versions of the question that have similar solutions: Giv...
متن کاملDynamic Graph Stream Algorithms in o(n) Space
In this paper we study graph problems in dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require Ω(n) space, where n is the number of vertices, existing works mainly focused on designing Õ(n) space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications ...
متن کامل